A Unified Strategy for Sequence and Sequence-less T-way Test Suite Generation
نویسندگان
چکیده
Highlights: In the last 20 years, many useful t-way strategies (where t indicates the interaction strength) have been developed to help generate test suite for detecting fault due to interaction of inputs. Although useful, existing t-way strategies have assumed sequence-less interactions amongst input parameters. In the case of reactive system, such an assumption is invalid. This paper presents a unified strategy based on the new meta-heuristic algorithm, called the Elitist Flower Pollination Algorithm (eFPA), for sequence and sequence-less coverage. Experimental results demonstrate the proposed strategy gives sufficiently competitive results as compared with existing works.
منابع مشابه
Using the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کاملIncremental Generation and Prioritization of t-way Strategy for Web Based Application
The adoption of t-way strategies termed as interaction testing for combinatorial testing is the main focus of this paper. Earlier work focus only on pairwise testing and the interaction coverage achieved is also not hundred percent. This paper discusses the different t-way strategies of uniform strength, variable strength, cumulative variable strength interactions for the test suite generation ...
متن کاملControl Flow Analysis for Reverse Engineering of Sequence Diagrams
Reverse engineering of UML sequence diagrams plays an important role in iterative development and in software maintenance. In static analysis for such reverse engineering, an open question is how to map control-flow graphs to the control-flow primitives of the recently-introduced new generation of UML. Our work presents the first algorithm that solves this problem. We also propose transformatio...
متن کاملThe Design and Optimization of Distillation Column with Heat and Power Integrated Systems
Based on two integration steps, an optimization framework is proposed in this work for the synthesis and design of complex distillation sequence. The first step is to employ heat integration in sequence and reduce the heat consumption and total annual cost of the process. The second one is to increase the exergetic efficiency of sequence by generating power in implemented expanders in sequence....
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کامل